Algorithms on Elliptic Curves over Fields of Characteristic Two with Non-adjacent Forms
نویسنده
چکیده
Let IFq be a finite field of characteristic two and let φ be the Frobenius endomorphism of an elliptic curve. To find or improve efficient algorithms for scalar multiplication sP of point P in the elliptic curve cryptography, it is always an important subject. If IFq = IF2, Solinas [5] has developed an algorithm for computing the φ-NAF. In this note, we extend Solinas’ φ-NAF algorithm to IFq, where q is a power of two, and give another efficient algorithms for φ-NAF, thereby show that the length of φ-NAF is at most two bits longer than the length of φ-expansion.
منابع مشابه
Elliptic curves with weak coverings over cubic extensions of finite fields with odd characteristic
In this paper, we present a classification of elliptic curves defined over a cubic extension of a finite field with odd characteristic which have coverings over the finite field therefore subjected to the GHS attack. The densities of these weak curves, with hyperelliptic and non-hyperelliptic coverings, are then analyzed respectively. In particular, we show, for elliptic curves defined by Legen...
متن کاملEfficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملFast Computation Methods for Scalar Multiplication on Elliptic Curves Defined over Higher Characteristic Finite Field
In this paper, we propose three algorithms to perform scalar multiplication on elliptic curves defined over higher characteristic finite fields such as the OEF (Optimal Extension Field). First, we propose an efficient scalar multiplication method in which the Frobenius expansion is used on an elliptic curve defined over OEF. Second, we propose a new finite field multiplication algorithm. Third,...
متن کاملTwisted μ4-Normal Form for Elliptic Curves
We introduce the twisted μ4-normal form for elliptic curves, deriving in particular addition algorithms with complexity 9M+ 2S and doubling algorithms with complexity 2M + 5S + 2m over a binary field. Every ordinary elliptic curve over a finite field of characteristic 2 is isomorphic to one in this family. This improvement to the addition algorithm, applicable to a larger class of curves, is co...
متن کاملEfficient Tate Pairing Computation for Supersingular Elliptic Curves over Binary Fields
After Miller’s original algorithm for the Tate pairing computation, many improved algorithms have been suggested, to name just a few, by Galbraith et al. and Barreto et al., especially for the fields with characteristic three. Also Duursma and Lee found a closed formula of the Tate pairing computation for the fields with characteristic three. In this paper, we show that a similar argument is al...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- I. J. Network Security
دوره 9 شماره
صفحات -
تاریخ انتشار 2009